Maximal codeword lengths in Huffman codes
نویسندگان
چکیده
منابع مشابه
Maximal Codeword Lengths in Huffman Codes
In this article, the authors consider the following question about Huffman coding, which is an important technique for compressing data from a discrete source. If p is the smallest source probability, how long, in terms of p, can the longest Huffman codeword be? It is shown that if p is in the range 0 < p _< I/2, and if K is the unique index such that I/FI<+3 < p _< 1/FK+2, where FK denotes the...
متن کاملOptimal Prefix Codes with Fewer Distinct Codeword Lengths are Faster to Construct
A new method for constructing minimum-redundancy prefix codes is described. This method does not explicitly build a Huffman tree; instead it uses a property of optimal codes to find the codeword length of each weight. The running time of the algorithm is shown to be O(nk), which is asymptotically faster than Huffman’s algorithm when k = o(log n), where n is the number of weights and k is the nu...
متن کاملHuffman Codes Lecturer : Michel
Shannon’s noiseless coding theorem tells us how compactly we can compress messages in which all letters are drawn independently from an alphabet A and we are given the probability pa of each letter a ∈ A appearing in the message. Shannon’s theorem says that, for random messages with n letters, the expected number of bits we need to transmit is at least nH(p) = −n ∑ a∈A pa log2 pa bits, and ther...
متن کاملApproximating Huffman Codes in Parallel
In this paper we present some new results on the approximate parallel construction of Huuman codes. Our algorithm achieves linear work and logarithmic time, provided that the initial set of elements is sorted. This is the rst parallel algorithm for that problem with the optimal time and work. Combining our approach with the best known parallel sorting algorithms we can construct an almost optim...
متن کاملCodeword Structure Analysis for LDPC Convolutional Codes
The codewords of a low-density parity-check (LDPC) convolutional code (LDPC-CC) are characterised into structured and non-structured. The number of the structured codewords is dominated by the size of the polynomial syndrome former matrix H (D), while the number of the non-structured ones depends on the particular monomials or polynomials in H (D). By evaluating the relationship of the codeword...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2000
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(00)00119-x